[20260202] BOJ / G3 / 크리스 마틴 / 한종욱 #1871
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/7977
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
길이가 n이면서 주어진 문자열과 LCS가 최소인 문자열을 출력하시오.
🔍 풀이 방법
문자열의 문자가 A, C, G, T로만 구성되어 있어 각각의 문자의 개수를 구한 다음 제일 적은 수로 이뤄진 문자로만 구성된 문자열이 답이다.
⏳ 회고
문제 해석이 너무 불친절했음